A new lattice decoding for space time block codes with low complexity
نویسندگان
چکیده
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal STBC with low complexity. We show that our proposed method gives the same decoding performance as the maximum-likelihood (ML) ratio decoding while it shows much lower complexity. Keywords–Space Time Coding, Lattice Decoding, Linear Dispersion Codes.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA Multiple Lattice Reduction Based Detector for Space Time Block Codes Based on Cyclotomic Extensions
Full diversity high-rate Space Time Block Codes (STBCs) based on cyclotomic field extensions Q(ωl), where ωl is the complex lth root of unity, can be decoded by Lenstra-Lenstra-Lovász (LLL) lattice reduction-aided linear equalization followed by appropriate zero forcing. LLL lattice reduction-aided linear equalization enables lower complexity decoding compared to sphere decoding, while resultin...
متن کاملA Novel Maximum Likelihood Detection Algorithm for Orthogonal Space-Time Block Codes
In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = K/T , where K is the number of transmitted symbols per T time slots, the proposed algorithm decomposes the original complex-valued system into a parallel...
متن کاملLow ML Decoding Complexity STBCs via Codes over GF(4)
In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field F4. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over F4, for number of transmit antennas N = 2m, ...
متن کامل